Functorial Data Migration
نویسنده
چکیده
In this paper we present a simple database definition language: that of categories and functors. A database schema is a category and a state is a set-valued functor. We show that morphisms of schemas induce three “data migration functors” that translate states from one schema to the other in canonical ways. Database states form a topos of which the classical “relational algebra” is a fragment. These ideas thus create a new denotational semantics for database theory.
منابع مشابه
Functorial Data Migration: From Theory to Practice
In this paper we describe a functorial data migration [6] scenario about the manufacturing service capability of a distributed supply chain. The scenario is a category-theoretic analog of an OWL ontologybased “semantic enrichment” scenario [5] developed at the National Institute of Standards and Technology (NIST). The scenario is presented using, and is included with, the open-source FQL tool, ...
متن کاملOn The Relational Foundations Of Functorial Data Migration
We study the data transformation capabilities associated with schemas that are presented by labeled directed multi-graphs and path equivalence constraints. Unlike most approaches which treat graph-based schemas as abbreviations for relational schemas, we treat graph-based schemas as categories. A morphism M between schemas S and T , which can be generated from a visual mapping between graphs, i...
متن کاملFunctorial semantics of topological theories
Following the categorical approach to universal algebra through algebraic theories, proposed by F.~W.~Lawvere in his PhD thesis, this paper aims at introducing a similar setting for general topology. The cornerstone of the new framework is the notion of emph{categorically-algebraic} (emph{catalg}) emph{topological theory}, whose models induce a category of topological structures. We introduce t...
متن کاملAlgebraic data integration
In this paper we present the first truly practical formalism for querying and integrating data using the functorial data model. In our formalism, database schemas and instances are multi-sorted equational theories of a certain form. Schemas denote categories, and instances denote their initial (term) algebras. The instances on a schema S form a category, S–Inst, and a morphism of schemas F : S→...
متن کاملData Base Mappings and Theory of Sketches
In this paper we will present the two basic operations for database schemas used in database mapping systems (separation and Data Federation), and we will explain why the functorial semantics for database mappings needed a new base category instead of usual Set category. Successively, it is presented a definition of the graph G for a schema database mapping system, and the definition of its ske...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Comput.
دوره 217 شماره
صفحات -
تاریخ انتشار 2012